Full friendly index sets of P2×Pn
نویسندگان
چکیده
LetG=(V ,E) be a graph, a vertex labeling f : V → Z2 induces an edge labeling f ∗ : E → Z2 defined by f ∗(xy)=f (x)+f (y) for each xy ∈ E. For each i ∈ Z2, define vf (i)=|f−1(i)| and ef (i)=|f ∗−1(i)|. We call f friendly if |vf (1)− vf (0)| 1. The full friendly index set of G is the set of all possible values of ef (1)− ef (0), where f is friendly. In this note, we study the full friendly index set of the grid graph P2 × Pn. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Full Friendly Index Sets of Slender and Flat Cylinder Graphs
Let G = (V, E) be a connected simple graph. A labeling f : V → Z2 induces an edge labeling f∗ : E → Z2 defined by f∗(xy) = f(x) + f(y) for each xy ∈ E. For i ∈ Z2, let vf (i) = |f−1(i)| and ef (i) = |f∗−1(i)|. A labeling f is called friendly if |vf (1)− vf (0)| ≤ 1. The full friendly index set of G consists all possible differences between the number of edges labeled by 1 and the number of edge...
متن کاملFull friendly index sets of cylinder graphs
Let G = (V,E) be a connected simple graph. A labeling f : V → Z2 induces an edge labeling f : E → Z2 defined by f(xy) = f(x) + f(y) for each xy ∈ E. For i ∈ Z2, let vf (i) = |f−1(i)| and ef(i) = |(f+)−1(i)|. A labeling f is called friendly if |vf (1) − vf(0)| ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if(G) = ef (1) − ef(0). The set {if(G) | f is a...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملUnique factorization theorem
A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induced-hereditary and additive if it is closed under taking induced subgraphs and disjoint unions of graphs, respectively. Let P1,P2, . . . ,Pn be properties of graphs. A graph G is (P1,P2, . . . ,Pn)-partitionable (G has property P1◦P2◦ · · · ◦Pn) if the vertex set V (G) of G can be partitioned into ...
متن کاملFull Edge-friendly Index Sets of Complete Bipartite Graphs
Let G = (V,E) be a simple graph. An edge labeling f : E → {0, 1} induces a vertex labeling f : V → Z2 defined by f(v) ≡ ∑ uv∈E f(uv) (mod 2) for each v ∈ V , where Z2 = {0, 1} is the additive group of order 2. For i ∈ {0, 1}, let ef (i) = |f−1(i)| and vf (i) = |(f+)−1(i)|. A labeling f is called edge-friendly if |ef (1) − ef (0)| ≤ 1. If (G) = vf (1) − vf (0) is called the edge-friendly index o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008